منابع مشابه
Linear Recursive Odometers and Beta-expansions
The aim of this paper is to study the connection between different properties related to β-expansions. In particular, the relation between two conditions, both ensuring pure discrete spectrum of the odometer, is analysed. The first one is the so-called Hypothesis B for the G-odometers and the second one is denoted by (QM) and it has been introduced in the framework of tilings associated to Piso...
متن کاملTree-based recursive partitioning methods for subdividing sibpairs into relatively more homogeneous subgroups.
We propose a new splitting rule for recursively partitioning sibpair data into relatively more homogeneous subgroups. This strategy is designed to identify subgroups of sibpairs such that within-subgroup analyses result in increased power to detect linkage using Haseman-Elston regression. We assume that the subgroups can be defined by patterns of non-genetic binary covariates measured on each s...
متن کاملThe Recursive Bayesian Estimation Problem Via Orthogonal Expansions: An Error Bound
When solving the non linear non Gaussian filtering problem via orthognal series expansions the involved probability density functions are approximated with truncated series expansions. Inevitable the truncation introduces an error. In this paper an upper bound on the 1-norm of the approximation error in the probability density function of the state vector conditional on the system output measur...
متن کاملF U N D a M E N T a Mathematicae Recursive Expansions
Let A be a recursive structure, and let ψ be a recursive infinitary Π2 sentence involving a new relation symbol. The main result of the paper gives syntactical conditions which are necessary and sufficient for every recursive copy of A to have a recursive expansion to a model of ψ, provided A satisfies certain decidability conditions. The decidability conditions involve a notion of rank. The ma...
متن کاملSimulating Expansions without Expansions
We add extensional equalities for the functional and product types to the typed -calculus with not only products and terminal object, but also sums and bounded recursion (a version of recursion that does not allow recursive calls of infinite length). We provide a confluent and strongly normalizing (thus decidable) rewriting system for the calculus, that stays confluent when allowing unbounded r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Fundamenta Mathematicae
سال: 1992
ISSN: 0016-2736,1730-6329
DOI: 10.4064/fm-140-2-137-155